package com.xqx;

import com.xqx.bubbleSort.BubbleSort;
import com.xqx.insertionSort.InsertionSort;
import com.xqx.mergeSort.MergeSort;
import com.xqx.quickSort.QuickSort;
import com.xqx.selectionSort.SelectionSort;
import com.xqx.shellSort.ShellSort;

import java.lang.reflect.Array;

public class TestOne {
    public static void main(String[] args) {
        int[] a = {42, 20, 17, 13, 28, 14, 23, 15};
        for (int i : a) {
            System.out.print(i + ",");
        }
        System.out.println("\n");
        //使用排序算法
        BubbleSort.BubbleSort_base(a);
//        SelectionSort.select_sort(a,a.length);//选择排序

//        InsertionSort.insert_sort(a, a.length); //插入排序

//        ShellSort.shell_sort(a,a.length);//希尔排序

//        QuickSort.quick_sort(a,0,a.length-1);//快速排序

/*        int[] b=new int[8];
        MergeSort.merge_sort(a,0,7,b); //归并排序
        for (int i : b) {
            System.out.print(i + ",");
        }*/

        for (int i : a) {
            System.out.print(i + ",");
        }
        System.out.println("\n");
    }
}
